Efficient Bottom-Up Parsing
نویسندگان
چکیده
This paper describes a series of experiments aimed at producing a bot tom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first a t tempt, ending with a system that was twice as fast as our previous parser, which relied on strong top-down constraints. The major algorithmic variations we tried are described along with the corresponding performance results.
منابع مشابه
Efficient Parsing for Word Structure
We describe an efficient parser for morphological analysis for a theory of X′-selection within the Strict Asymmetry framework. The bottom-up parser is based on a full LR(1) analyzer, modified to handle the processing of both overt and covert morphemes in a locally deterministic and efficient manner.
متن کاملEfficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic interpretation can in principle be read. We contrast two predictive parsing approaches, t...
متن کاملLanguage Modeling Using Efficient Best-first Bottom-up Parsing
In this paper we present a two-stage best-first bottom-up word-lattice parser which we use as a language model for speech recognition. The parser works by using a “Figure of Merit” that selects lattice paths while simultaneously selecting syntactic category edges for parsing. Additionally, we introduce a modified version of the Inside-Outside algorithm used as a pruning stage between syntactic ...
متن کاملFence - An Efficient Parser with Ambiguity Support for Model-Driven Language Specification
Model-based language specification has applications in the implementation of language processors, the design of domain-specific languages, model-driven software development, data integration, text mining, natural language processing, and corpus-based induction of models. Model-based language specification decouples language design from language processing and, unlike traditional grammar-driven ...
متن کامل1 Are Efficient Natural Language Parsers Robust ?
This paper discusses the robustness of four efficient syntactic error-correcting parsing algorithms that are based on chart parsing with a context-free grammar. In this context, by robust we mean able to correct detectable syntactic errors. We implemented four versions of a bottom-up error-correcting chart parser: a basic bottom-up chart parser, and chart parsers employing selectivity, top-down...
متن کامل